Multipliers of convergence in norm of series with respect to multiplicative systems

We prove analogs of the Telyakovskii-Pochuev criteria for multipliers of uniform convergence and of convergence in the integral metric for multiplicative systems with bounded generating sequence.     

The measure of a translated ball in uniformly convex spaces

Let (E, ¦·¦) be a uniformly convex Banach space with the modulus of uniform convexity of power type. Let be the convolution of the distribution of a random series inE with independent one-dimensional components and an arbitrary probability measure onE. Under some assumptions about the components and the smoothness of the norm we show that there exists a constant such that |{·<t}–{·+r<t}|r ^q , whereq depends on the properties of the norm. We specify it in the case ofL spaces, >1.     

Gowers norms and pseudorandom measures of subsets

Let $A \subset {{\Bbb Z}_N}$, and ${f_A}(s) = \left\{ {\begin{array}{*{20}{l}}{1 - \frac{{|A|}}{N},}&{{\rm{for}}\;s \in A,}\\{ - \frac{{|A|}}{N},}&{{\rm{for}}\;s \notin A.}\end{array}} \right.$ We define the pseudorandom measure of order k of the subset A as follows, P_k(A, N) = $\begin{array}{*{20}{c}}{\max }\\D\end{array}$|$\mathop \Sigma \limits_{n \in {\mathbb{Z}_N}}$f_A(n + c₁)f_A(n + c₂) … f_A(n + c_k)|, where the maximum is taken over all D = (c₁, c₂, . . . , c_k) ∈ ${\mathbb{Z}^k}$ with 0 ≤ c₁ < c₂ < … < c_k ≤ N - 1. The subset A ⊂ ${{\mathbb{Z}_N}}$ is considered as a pseudorandom subset of degree k if P_k(A, N) is “small” in terms of N. We establish a link between the Gowers norm and our pseudorandom measure, and show that “good” pseudorandom subsets must have “small” Gowers norm. We give an example to suggest that subsets with “small” Gowers norm may have large pseudorandom measure. Finally, we prove that the pseudorandom subset of degree L(k) contains an arithmetic progression of length k, where L(k) = 2·lcm(2, 4, . . . , 2|$\frac{k}{2}$|), for k ≥ 4, and lcm(a₁, a₂, . . . , a_l) denotes the least common multiple of a₁, a₂, . . . , a_l.     

Local minima of the trust region problem

We consider the minimization of a quadratic formzVz+2zq subject to the two-norm constraint z=. The problem received considerable attention in the literature, notably due to its applications to a class of trust region methods in nonlinear optimization. While the previous studies were concerned with just the global minimum of the problem, we investigate the existence of all local minima. The problem is approached via the dual Lagrangian, and the necessary and sufficient conditions for the existence of all local minima are derived. We also examine the suitability of the conventional numerical techniques used to solve the problem to a class of single-instruction multiple-data computers known as processor arrays (in our case, AMT DAP 610). Simultaneously, we introduce certain hardware-oriented multisection algorithms, showing their efficiency in the case of small to medium size problems.This research was partially supported by the National Physical Laboratories of England under Contract RTP2/155/127.     

Normsets and determination of unique factorization in rings of algebraic integers

The image of the norm map from to (two rings of algebraic integers) is a multiplicative monoid . We present conditions under which is a UFD if and only if has unique factorization into irreducible elements. From this we derive a bound for checking if is a UFD.

     

The dual of a constacyclic code,self dual,reversible constacyclic codes and constacyclic codes with complementary duals over finite local Frobenius non-chain rings with nilpotency index 3

Over finite local Frobenius non-chain rings with nilpotency index 3 and when the length of the codes is relatively prime to the characteristic of the residue field of the ring, the structure of the dual of $\gamma$-constacyclic codes is established and the algebraic characterization of self-dual $\gamma$-constacyclic codes, reversible $\gamma$-constacyclic codes and $\gamma$-constacyclic codes with complementary dual are given. Generators for the dual code are obtained from those of the original constacyclic code.     

On the Lipschitz equivalence of self‐affine sets

Recently Lipschitz equivalence of self‐similar sets on has been studied extensively in the literature. However for self‐affine sets the problem is more awkward and there are very few results. In this paper, we introduce a w‐Lipschitz equivalence by repacing the Euclidean norm with a pseudo‐norm w. Under the open set condition, we prove that any two totally disconnected integral self‐affine sets with a common matrix are w‐Lipschitz equivalent if and only if their digit sets have equal cardinality. The main methods used are the technique of pseudo‐norm and Gromov hyperbolic graph theory on iterated function systems.     

Gorenstein平坦模与Frobenius扩张

设R■A是环的Frobenius扩张,其中A是右凝聚环,M是任意左A-模.首先证明了_AM是Gorenstein平坦模当且仅当M作为左R-模也是Gorenstein平坦模.其次,证明了Nakayama和Tsuzuku关于平坦维数沿着Frobenius扩张的传递性定理的"Gorenstein版本":若_AM具有有限Gorenstein平坦维数,则Gfd_A(M)=Gfd_R(M).此外,证明了若R■S是可分Frobenius扩张,则任意A-模(不一定具有有限Gorenstein平坦维数),其Gorenstein平坦维数沿着该环扩张是不变的.